class InsertSort:
    def __init__(self, array):
        self.array=array
    def insert_sort(self):
        for i in range(1,len(self.array)):
            end=i
            tmp=self.array[end]
            while end>=0:
               if tmp <self.array[end]:
                   self.array[end+1]=self.array[end]
                   end=end-1
               else:
                   break
            self.array[end+1]=tmp
        return self.array



class PrintSort:
    def __init__(self, array):
        self.array=array
    def print_sort(self):
        for i in range(len(self.array)):
            print(self.array[i])
          


